Recursion in total functionals of finite type
نویسنده
چکیده
© Foundation Compositio Mathematica, 1977, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http:// http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
منابع مشابه
Recursion on the partial continuous functionals
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the well-known abbreviation LCF. However, the prime example of such a theory, Per Martin-Löf’s type theory [24] in its present form deals with total (structural recursive) functionals only. An early at...
متن کاملModified bar recursion
We introduce a variant of Spector’s bar recursion (called “modified bar recursion”) in finite types to give a realizability interpretation of the classical axiom of countable choice allowing for the extraction of witnesses from proofs of Σ1 formulas in classical analysis. As a second application of modified bar recursion we present a bar recursive definition of the fan functional. Moreover, we ...
متن کاملAbout and around Computing over the Reals
Computation Procedures • Abstract Computation Procedures (ACPs), (Feferman 1992); should have been called Abstract Recursion Procedures. • Here structures are specified by (possibly) manysorted domains, individual constants, partial functions, and partial monotonic functionals of type level 2. ACP Computable Functions and Functionals • The ACP schemata are given by Explicit Definition in type l...
متن کاملFunctional interpretation and inductive definitions
Extending Gödel’s Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.
متن کاملRepresentation theorems for transfinite computability and definability
The continuous functionals were independently introduced by Kleene [6] and Kreisel [7]. Kleenes motivation was to isolate a subclass of the total functionals of pure, finite type closed under S1-S9-computations (Kleene [5]) which could be described using countable information. He defined his functionals via the associates and the idea is that an associate for a functional Ψ contains sufficient ...
متن کامل